Parallel Computing of Polymer Chains Based on Monte Carlo Method
نویسندگان
چکیده
Computer simulation of polymer chain is carried out by Monte Carlo method in this paper. The properties of polymer chain are simulated by self avoiding walk and bond fluctuation model. The parallel computing model is established to solve the physical problems of the polymer chains. We analyze the algorithms for polymer chains to parallel computing at high performance computing center. Gustafson law is analyzed and is applied to obtain linear speedup. Copyright © 2013 IFSA.
منابع مشابه
Two and Three Dimensional Monte Carlo Simulation of Magnetite Nanoparticle Based Ferrofluids
We have simulated a magnetite nanoparticle based ferrofluid using Monte Carlo method. Two and three dimensional Monte Carlo simulations have been done using parallel computing technique. The aggregation and rearrangement of nanoparticles embedded in a liquid carrier have been studied in various particle volume fractions. Our simulation results are in complete agreement with the reported experim...
متن کاملProperties of Confined Polymer Melts
Properties of simple models of confined linear polymer chains were studied by means of the Monte Carlo method. Model chains were built of united atoms (statistical segments) and embedded to a simple cubic lattice. Then polymers were put into a slit formed by two parallel impenetrable surfaces. Chain lengths were varied up to 800 segments and the density of the polymer melt was changed up to 0.5...
متن کاملMonte Carlo methods for strongly interacting polymer systems
Markov chain Monte Carlo methods often su er from slow convergence problems when applied to strongly interacting polymer systems. One way to alleviate these problems is to run several Markov chains in parallel, with the di erent Markov chains being designed to sample at di erent temperatures, and with suitable swapping of con gurations between pairs of chains. This method was rst invented by Ge...
متن کاملThe Hybrid Monte Carlo Method for Polymer Chains
The use of the Hybrid Monte Carlo method in simulating off-lattice polymer chains is discussed. I focus on the problem of finding efficient algorithms for long flexible chains. To speed up the simulation of such chains the Fourier acceleration technique is used. Numerical results are presented for four models with different repulsive interactions between the monomers.
متن کاملData Splitting for Parallel Linear Algebra Monte Carlo Algorithms
Many scientific and engineering applications involve the inversion of large matrices or solving systems of linear algebraic equations. Solving these problems with proven algorithms for direct methods can take very long to compute, as they depend on the size of the matrix. The computational complexity of the Monte Carlo methods depend only on the number of chains and the length of those chains a...
متن کامل